Gcd of Truncated Rows in Pascal’s Triangle
نویسندگان
چکیده
In this paper we study gcd (( n t ) , ( n t+1 ) , ..., ( n n−t )) . By arranging these numbers in a triangle and exploring a local divisiblity property of its elements, we uncover relations among them which lead to an interesting description of their complete prime factorization.
منابع مشابه
The generalization of Pascal’s triangle from algebraic point of view
In this paper we generalize Pascal’s Triangle and examine the connections between the generalized triangles and powering integers and polynomials respectively. The interesting and really romantic Pascal’s Triangle is a favourite research field of mathematicians for a very long time. The table of binomial coefficients has been named after Blaise Pascal, a French scientist, but was known already ...
متن کاملThe fractal nature of the Fibonomial triangle
It is well known that Pascal’s triangle exhibits fractal behavior when reduced modulo a prime. We show that the triangle of Fibonomial coefficients has a similar nature modulo two. Specifically, for any m ≥ 0, the subtriangle consisting of the first 3 · 2m rows is duplicated on the left and right sides of the next 3 · 2m rows, with an inverted triangle of zeros in between. We give three proofs ...
متن کاملCongruences for a Class of Alternating Lacunary Sums of Binomial Coefficients
An 1876 theorem of Hermite, later extended by Bachmann, gives congruences modulo primes for lacunary sums over the rows of Pascal’s triangle. This paper gives an analogous result for alternating sums over a certain class of rows. The proof makes use of properties of certain linear recurrences.
متن کاملOn Pascal’s Triangle modulo 2 in Fibonacci Representation
In the present paper we consider an analogous problem, but instead of using the binary number system as Hewgill did, we interpret every second row of modulo 2 reduced Pascal’s triangle in the Fibonacci number system. Moreover, we are interested about the whole family of sequences where the even indexed rows specify the most significant digits (“fibits”) of the Zeckendorf expansion of an integer...
متن کاملFibonacci words in hyperbolic Pascal triangles
The hyperbolic Pascal triangle HPT 4,q (q ≥ 5) is a new mathematical construction, which is a geometrical generalization of Pascal’s arithmetical triangle. In the present study we show that a natural pattern of rows of HPT 4,5 is almost the same as the sequence consisting of every second term of the well-known Fibonacci words. Further, we give a generalization of the Fibonacci words using the h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004